• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    To reconstruct with a smaller number of retransmissions of the data packet in the attempts to reconstruct a data packet received in error in a wireless sensor network, it is proposed to include in the receiving unit (2) a first and a second methods for the reconstruction of the erroneously received data packet (DP) implement, in a first step, the first method for the reconstruction of the incorrectly received data packet (DP) and thereby check whether the data packet (DP) has been reconstructed, and in a following second step the second method for the reconstruction of the erroneously received data packet ( DP) if the incorrectly received data packet (DP) was not reconstructed with the first method, and thereby check whether the data packet (DP) was reconstructed with it.
    公开号:AT514851A2
    申请号:T50762/2014
    申请日:2014-10-23
    公开日:2015-04-15
    发明作者:Peter Dipl Ing Priller；Alexander Entinger；Achim Dipl Ing Berger
    申请人:Avl List Gmbh；
    IPC主号:
    专利说明:

    A method of reconstructing a data packet erroneously received in a wireless sensor network
    The present invention relates to a method for reconstructing a faulty received data packet that has been sent in a wireless sensor network from a radio node to a receiving unit.
    For controlling, controlling, monitoring machines, e.g. Production machines, motor vehicles, handling machines (robots), etc., or equipment such as e.g. Production facilities, production facilities, test benches for vehicles or vehicle parts, etc., a variety of sensors are used to capture a variety of measurements and send the measured values of the measured variables to associated control units. To the same extent, such machines and equipment also include a plurality of actuators to control the machine or equipment under control of the control unit. For example, a modern vehicle includes various control units, such as e.g. an engine control unit (ECU), a transmission control unit (TCU), a hybrid control unit (HCU), a brake control unit (BCU), etc., all of which receive and process various measurement values from various sensors installed on the vehicle. Based on these measured values, actuators which are likewise installed make different interventions on the vehicle or on vehicle components, for example the adjustment of the air-fuel ratio on the basis of a current CO, CO 2 or NO x content in the exhaust gas. The entirety of the installed sensors and actuators, or a part thereof, is referred to as a sensor network.
    However, the plurality of sensors and actuators must be connected to the controller (s), which requires wiring. Fieldbuses are often used with the I / O units and a control unit via a data bus, e.g. CAN, LIN, FlexRay, Ethernet, etc. are interconnected. The sensors and actuators are wired to an I / O unit connected to the data bus as a bus participant. There are also hard-wired systems in which a sensor with an assigned control unit is hardwired via its own cable. This requires a huge amount of cabling with high costs, high failure potential, high installation costs, high maintenance and high weight.
    Turning away from such wired sensor networks, wireless sensor networks are increasingly being used in which a wireless sensor / actuator, referred to below as a radio node, exchanges data with an associated control unit via a wireless data connection. This eliminates the previously required for this wiring effort at least partially. Such wireless sensor networks include a plurality of radio nodes that communicate with an associated base station. In this case, of course, a plurality of base stations, with each of which a plurality of radio nodes are connected, may be provided.
    But there are also a number of problems in wireless sensor networks. The industrial environment of the wireless sensor network is often harsh with many types of interference (e.g., electromagnetic interference sources, signal shading, signal reflections, etc.) for wireless data communication. In addition, the wireless sensor network often needs to communicate with the transmission channel (especially a particular frequency range) with other wireless communication systems, such as the wireless network. Wi-Fi or Bluetooth, which can also cause interference. Last but not least, the power supply of the wireless sensors / actuators is a major problem, since a sufficient service life of the radio node is required for industrial use. In particular, the wireless data transmission but requires large amounts of electrical energy, so that the battery life of the radio node can be problematic. In addition, a sufficiently low data transmission error rate and high data transmission rate in the data transmission must be achievable in order to be able to use a wireless sensor network in the industrial environment at all.
    Basically, in digital data transmission technology, there are known error detection and error correction mechanisms that could be used with wireless sensor networks. However, such error detection and correction mechanisms certainly involve complex calculations that would have to be made in the case of a wireless sensor network in the transmitting radio node, but this is energy intensive. Such methods are therefore hardly usable in wireless sensor networks in industrial environments.
    Wireless sensor networks have therefore been the subject of much research and development in recent years to solve the problems involved.
    In order to reduce the data transmission error rate, strategies already geared towards the requirements of wireless sensor networks have been developed to check and correct received data. In E. Uhlemann, et al., "Hard Decision Packet Combining Methods for Industrial Wireless Relay Networks", Communications and Electronics, 2008. IC-CE 2008. Second International Conference on Communication and Electronics, 4-6. For example, June 2008, pp. 104-108, describes how received data in the receiver is corrected based on a CRC (Cyclic Redundancy Code). For this purpose, an erroneously received data packet, which is determined by the CRC, not thrown away, but stored in a buffer. The incorrectly received data packet is transmitted again by the sender. If the check of the CRC again results in an erroneous data transmission, the previously buffered message and the newly received message are analyzed bit by bit and attempted to reconstruct the correct data by iterating the bits in the positions in which the two data packets are differentiated and each CRC is checked. This method is known as combinatorial testing. If the data packet can not be reconstructed, another retransmission of the data packet may be requested. This succeeds in reducing the data transmission error rate and the number of necessary data transmissions. A similar procedure can also be taken from US Pat. No. 8,327,232 B2.
    The disadvantage of this method is that this always a retransmission of the incorrectly received data packet is necessary, which is undesirable from the point of view of the limited electrical energy in the transmitting radio node, since it reduces the battery life is reduced.
    It is now an object of the subject invention to provide a method for reconstructing a faulty received data packet in a receiving unit of a wireless sensor network, which manages with a smaller number of retransmissions of the data packet.
    This object is achieved by a method in which a first and a second methods for the reconstruction of an incorrectly received data packet are implemented in the receiving unit, in a first step the first method for the reconstruction of the erroneously received data packet is applied and it is checked whether this is the case the data packet was reconstructed and in a following second step, the second method for the reconstruction of the erroneously received data packet is applied, if the erroneously received data packet was not reconstructed with the first method, and it is checked whether the data packet was reconstructed therewith. By implementing different methods of reconstruction, different complex methods can be used, which require different computation effort and promise different success probabilities. This makes it possible, in a first step, to apply a simple first method to the incorrectly received data packet, which preferably comes to fruition with little computational effort. If the first method is successful, the data packet can thus be successfully reconstructed, it is unnecessary to apply a second method or even to request a retransmission of the data packet. With the second method, a retry reconstruction attempt can be made on the incorrectly received data packet, likewise without requiring a retransmission of the data packet. Here, methods are preferred that make it possible to manage with little computational effort. The underlying reason for this is that due to the implemented data transmission protocol, only a limited amount of time is available until a retransmission of the data packet must be requested in the case of a faulty transmission. Thus, only this limited amount of time is available to undertake reconstruction attempts. It makes sense, therefore, to start with a method that requires less computational effort, since then the likelihood is great that there is still sufficient time for the implementation of a second method. The successive application of various methods for the reconstruction of a badly received data packet overall increases the probability that an incorrectly received data packet will be reconstructed without a retransmission being required.
    In this case, it is also avoided, in the receiving unit, a very powerful hardware, e.g. large RAM, fast processor, highly parallel computer (multi-core), etc., to use. Of course, this would allow the application of very complex methods of reconstruction, but no available standard hardware could be used as the receiving unit. In contrast, the invention enables the highest possible repair success with the least possible hardware expense.
    The method can advantageously be extended by using in at least one further subsequent step a further method implemented in the receiving unit for the reconstruction of the erroneously received data packet if the data packet received in error has not been reconstructed with the second method and is thereby checked, if so the data package was reconstructed. The application of further reconstruction methods further increases the likelihood that a data packet received in error will be reconstructed without requiring a retransmission.
    A particularly simple method, which can be carried out with little computational effort, results if the value of at least one bit of a data field of the data packet is known and in the incorrectly received data packet this at least one bit is changed and it is checked whether the data packet was reconstructed with this change. A priori knowledge about the structure of the data packet can be used to quickly examine certain bits of the data packet for a possible error.
    In an advantageous second method, a posteriori derivable knowledge about the data packet is used, whereby the expected value of at least one bit of a data field is derived from the erroneously received data packet and this at least one bit in the erroneously received data packet is changed and it is checked whether this change the data packet was reconstructed. Here, the computational effort is slightly higher than in the first method, since the data package must first be examined, but can still be performed fast enough even on standard hardware.
    To further increase the probability of repair, another method of reconstructing a badly received data packet may be implemented, which may be performed according to the second method, if the previous two methods have failed. In this case, an advantageous further method is when an error block with a length of bits is shifted stepwise over at least part of the erroneously received data packet and in each step all bits lying in the error block are inverted and checked in each step, whether with this change the data packet was reconstructed. In a possible adaptation of the further method, the bits lying in the error block can be iterated in each step and in each case checked whether the data packet was reconstructed with this change, which further increases the probability of the reconstruction.
    If it should not be possible to reconstruct the data packet without retransmission, it may be provided to apply further methods based on retransmission of the data packet. One possible method is to compare at least two incorrectly received data packets and to determine bit positions at which the two data packets differ and to step through the bits at at least one of these bit positions and to check in each step whether the data packet is reconstructed with this change has been. It can also be provided to define the bit position a bit area with a number of bits before and / or a number of bits after the bit position and to iterate through the bits in the bit area step by step.
    The subject invention will be explained in more detail below with reference to Figures 1 to 11, which show by way of example, schematically and not by way of limitation advantageous embodiments of the invention. It shows
    1 shows a typical configuration of a wireless sensor network,
    2 shows the data transmission according to a synchronous time division multiplex method,
    3 shows a scheme for the retransmission of a data packet,
    4 shows the structure of a data packet with different data fields,
    FIGS. 5 and 6 show examples of a priori knowledge about the content of specific data fields;
    FIGS. 7 and 8 show an example of a method for reconstructing a data packet received incorrectly;
    9 and 10 show an example of a method for reconstructing an erroneously received data packet that requires retransmission of the data packet and
    11 shows a possible method sequence in the method according to the invention for the reconstruction of an incorrectly received data packet.
    FIG. 1 shows a typical configuration in a wireless sensor network 1 with a base station BS. A number of radio nodes FK1 ... FKn are wirelessly connected to the associated base station BS (indicated by dashed lines) and exchange data therewith over a wireless data link. The base station BS is in turn connected to a control unit SE, to which several base stations BS, each with a number of associated radio nodes FK, may be connected. Of course, the base station BS and the control unit SE could also be integrated in one device. In the case of a sensor as a radio node FK, the radio node FK sends data (usually measured values of a measured variable) in the form of data packets DP to the base station BS, in the case of an actuator as a radio node FK correspondingly reversed, the data typically including control instructions. The base station BS may also transmit data packets DP to one or all of the radio nodes FK, e.g., to implement a data transmission protocol. to request a retransmission of a particular data packet DP, for example, if this data packet was received incorrectly. However, it should be noted that the actual invention does not depend on the specific data transmission protocol, which is therefore only described insofar as it is necessary for the understanding of the invention.
    Depending on the topology of the wireless sensor network 1, instead of a base station BS, another network subscriber may also be provided, e.g. a repeater (also a radio node functioning as such) which is wirelessly connected to a number of radio nodes FK. Therefore, the following is generally spoken by a receiving unit 2. For a wireless sensor network 1, it is advantageous if the data transmission is implemented in synchronous time division multiple access (TDMA), but the invention is not limited thereto. In the TDMA method, time slots ZSm are defined in a cyclically repeated transmission cycle TZ, within each of which an assigned radio node FKn may transmit. Each radio node FKn therefore always transmits in a transmission cycle TZ in the same time slot ZS. In order to suppress the energy required for the data transmission, it can be provided that TZ data is not transmitted in each transmission cycle, but the data is collected in the radio node FKn and the collected data are transmitted in a data packet DP only in every xth transmission cycle TZ become. This is shown schematically in FIG. In the transmission cycle TZ1, the radio node FKn transmits a data packet DP1 to the receiving unit 2 in the assigned time slot ZS2. After x transmission cycles TZx, the radio node FKn again transmits a data packet DP2. The receiving unit 2 sends in each transmission cycle TZ a response to the Funknot FK, here in the last time slot ZSm, for example, with an acknowledgment of the receipt of a data packet DP1 and / or the request for the retransmission of certain data packets DP. In the case of a retransmission, the radio node FKn would not wait until the next transmission cycle TZx but would resend the data packet DPT in the next transmission cycle TZ2.
    In an exemplary embodiment, the length of the transmission cycle TZ can be 100 ms, which is divided into m = 10 time slots ZSm with a length of 10 ms. Thus, nine radio nodes FKn (a time slot ZSm for the return channel) could be connected to a receiving unit. A fun node FKn sends every x = 10th transmission cycle TZ. If the radio node FKn detects as sensor every 100 ms of sensor data (for example a measured value), then the radio node can send ten sensor data SD in a data packet DP to the receiving unit 2 every second.
    3 shows an example of a scheme for the retransmission of a data packet DP. In the first transmission TA1, a data packet DP1 is connected to e.g. transfer ten sensor data SD1 ... SD10 to a length of 2 bytes each. In the case of a retransmission TA2, the sensor data SD1... SD10 are sent again in the data packet DPT in the next transmission cycle TZ, a newly acquired measured value in the meantime being added as additional sensor data SD11. This can be repeated up to a certain maximum length of the data packet DP1. In the example shown, five retransmissions with new sensor data SD11 ... SD15 are permitted (data packet DP1 "). Thereafter, the oldest sensor data would be removed, for example, the sensor data SD1 from a new data packet DPT ", which would lead to data loss. In order to distinguish the retransmissions TA2... TA8, different message types MsgT can also be defined in the data packet DP.
    The structure of a data packet DP for the implementation of the invention is shown by way of example in FIG. The data packet DP contains various data fields DF, for example 3 bytes for identifying the logical channel K, which essentially defines the assigned receiving unit, 1 byte with a length L of the data packet DP, 5 bytes with header data H, 10-15 times 2 bytes with sensor data SD and 2 bytes with a CRC check value.
    The header data H in turn comprise different data fields DF, here a message type MsgT, a radio node address SA in the wireless sensor network, a base address as the unique address of a receiving unit 2 and 2 bytes the current state of charge VBatt of the supply battery of the radio node FK. The 2-byte sensor data SD are transmitted in each case in a high byte SDHB and a low byte SDLB. Similarly, the check value CRC is divided into a high byte CRCHB and a low byte CRCLB, as well as the state of charge VBatt. Of course, this data structure of a data packet DP is only an example and can be chosen arbitrarily.
    The method according to the invention now exploits the fact that the content of certain data fields DF is known in advance, e.g. due to the implemented data protocol or due to the knowledge of the transmitted data. As a result, certain bit values of data fields DF can be expected, as will be explained below by means of examples.
    Data field length L:
    Depending on the data transmission protocol, the length L of specific data fields DF in the data packet DP or also the total length of the data packet DP can be specified as the length L. If e.g. the total length of a data packet DP according to FIG. 4 is between 31 bytes and 41 bytes (depending on the length of the sensor data SD) and overhead data, such as e.g. the logical channel K, the length L and the check value CRC are subtracted, then the data field DF for the length L could indicate the length of the payload, here the message type MsgT, the radio node address SA, the base address BA and the current state of charge VBatt, include. Thus, the data field DF for the length L can only assume the values in the range of 25 to 35, ie L = [25, 35], or in binary terms L = [0001 1001.0010 0011], whereby the value can only increase by 2 since the sensor data SD comprises 2 bytes each. Thus, the two highest bits of the data field DF for the length L must always be 0 and the lowest bit always 1.
    Base Address BA:
    The base address BA of the receiving units 2 in the wireless sensor network 1 are assigned in advance and are thus known. Are e.g. If there are three receiving units 2 with base address BA (hexadecimal) 0x01, 0x02, 0x03, then the five highest bits of the data field DF for the base address BA must always be 0.
    Message type MsgT:
    The possible message types are determined by the implemented data transmission protocol. In the example according to FIG. 3, e.g. only the following values are possible (hexadecimal): MsgT = (0x12, 0x13, ..., 0x18). This means that the highest four bits of the data field DF for the message type MsgT must always be 0.
    State of charge VBatt:
    From the knowledge of the radio node FKn used, it is known with which resolution the state of charge VBatt is transmitted. If e.g. the battery voltage is measured in the radio node as state of charge VBatt and digitized with a 10-bit analog-to-digital converter (ADC), then the data field DF for the state of charge VBatt occupy only the lowest ten bits, so the highest six bits must always be 0, such as shown in Fig.5.
    Sensor data SD:
    From the knowledge of the used radio node FKn, it is known with which resolution measured values are recorded. If e.g. measured in the radio node and digitized with a 10-bit ADC, then a data field DF for sensor data SD occupy only the lowest ten bits, so that the highest six bits must always be 0, as shown in Figure 6.
    In a wireless sensor network 1 are thus transmitted from a radio node FK data packets DP to a receiving unit 2, wherein the data packet DP includes a plurality of data fields DF and at least one data field DF the value of at least one bit of the data field DF is known in advance. If a data packet DP is received and detected in the receiving unit 2, for example based on the included check value CRC, that the data field is corrupted, this information can be used for an attempt to reconstruct the data packet DP without requiring retransmission of the data packet DP. For this purpose, a data field DF of the data packet DP having an expected known bit value can be examined in the receiving unit 2 and it can be checked whether the expected bit position contains the expected value (0 or 1). If this is not the case, the value of this bit can be changed and checked on the basis of the check value CRC, whether the received data packet DP could thus be reconstructed. This can be repeated for all bits of the data packet DP that must have a certain known value. With this approach, it is often possible to reconstruct data packets DP, without requiring a retransmission of the data packet DP. This method is referred to in further consequence as an a priori method, because previously known knowledge is used.
    In addition, information can also be derived from the data packet DP itself, which could be used for the reconstruction. Also, the derivable information about certain bits of the data packet DP is regarded as known information. This also results from the fact that for certain data fields DF a certain content, ie specific bit values, is expected, as will be explained below by way of examples.
    Message type MsqT:
    The message type MsgT can be derived from the number of sensor data SD contained in the data packet DP. As shown in FIG. 3, each retransmission of a data packet DP receives its own message type MsgT. Since the length of the sensor data SD (in 2-byte increments) increases at the same time with each retransmission, one can deduce from the number of
    Sensor data SD an expected message type MsgT derived. If e.g. Receive 11 times 2 byte sensor data SD, then a message type MsgT 0x13 is expected (Fig.3).
    Sensor Address SA:
    When using the TDMA transmission method (see FIG. 2), an expected sensor address AS can be derived from the time slot ZS in which the data packet DP was received, since each radio node FK (with a assigned sensor address SA) is assigned to a time slot ZS. If the radio node FK1 with the sensor address SA 0x01 is assigned to the time slot ZS1, then it is assumed that each data packet DP received in this time slot ZS1 originates from this radio node FK1 and therefore the sensor Address SA contained in these data packets DP will be 0x01 got to.
    It can therefore again proceed in such a way that, in the case of a corrupted received data packet DP, the value of at least one data field DF of the data packet DP is changed on the basis of previously existing knowledge and it is checked whether such a change reconstructs the data packet DP. This method is also referred to as a posteriori method because knowledge is derived from a received data packet DP.
    Apart from the application of known or derivable knowledge about the data packet DP, other mechanisms can also be used for an attempt to reconstruct an incorrectly received data packet DP.
    In a first such method (also referred to as a consecutive bits method), which will be described with reference to Fig. 7, an error block FB having a length of i bits is set. The error block FB is pushed over the entire data packet DP or over a part of the data packet DP (for example header H + sensor data SD) with a step size of 1 bit, whereby each bit in the error block FB is inverted and the check value CRC is checked in each step. In this case, the length i can also be increased in several passes. This method assumes that burst-like interference occurs and that always several adjacent bits are disturbed.
    7, an error block FB with a length i = 1 is first pushed over a data packet DP and the respective bit in the error block FB is inverted with respect to the corresponding bit in the received data packet DP (0 -> 1, 1 -> 1). 0) (underlined bits).
    In each step, the check value CRC is checked and aborted if a correct check value CRC results. If not, the length i of the error block FB is increased by 1, the error block FB is again pushed over the data packet DP and again all bits in the error block FB are inverted (underlined bits). This can be repeated up to a certain predetermined length i.
    FIG. 8 also shows an extension to the method according to FIG. The bits in an error block FB are not simply inverted, but the bits are iterated through in the error block so that all possible bit assignments are checked.
    Also with this an attempt at a data reconstruction can be carried out without requiring a retransmission of a data packet DP. If a faulty data packet DP can not be recovered with these methods, then other known methods, such as e.g. Combinatorial Testing, as described below with reference to FIG. 9, may be used.
    In the example according to FIG. 9, a data packet DP1 was received and it was determined via the check value CRC that the received data packet DP1 is faulty. The data packet DP1 is then stored and requested a retransmission of the data packet DP1. The newly transmitted data packet DPT is checked again using the test value CRC. If the data packet DPT is in order, it is taken over and no reconstruction attempts are necessary. However, if the newly transmitted data packet DPT is also faulty, then combinatorial testing is used. In this case, however, it should be taken into consideration that the newly transmitted data packet DPT may possibly contain additional sensor data SD11 (cf. FIG. 3) (as indicated in FIG. 9), which should be expediently excluded for combinatorial testing. In combinatorial testing, first the bit positions are determined at which the data packets DP1, DPT differ (underlined in FIG. 9). These bit positions are now durchiteriert by all possible bit value assignments are tried and in each case the test value CRC is calculated. If the check value CRC is correct, the changed data packet DP1 is passed on as the correct data packet.
    If this does not succeed in a successful reconstruction of the data packet DP1, the second data packet DPT is also stored and a new retransmission can be requested. Combinatorial Testing can then be applied to all stored data packets DP1, DPT, DP1 upon receipt of the retransmitted data packet DP1 or to any pairing of the stored data packets DP1, DPT, DP1.
    FIG. 10 also shows a possible adaptation of the combination testing according to FIG. Here, i bits are added before and after the differing bit positions (underlined) (i = 1 in Fig. 10) and all possible bit assignments in these bit areas BB are iterated. Of course, various modifications are conceivable here, such as the extension only before or only after the differing bit positions or different number of bits before and after the differing bit positions.
    In a further adaptation of combinatorial testing, one could also provide for not immediately changing all differing bit positions, but for selecting certain bit positions according to certain criteria and for changing them first. For example, the data field DF could be used for the state of charge VBatt in order to examine the end of the data packet DP first when the state of charge VBatt is low, since at low state of charge VBatt it can be assumed that the transmission power of the radio node FK breaks down due to an approximately empty energy store. It would also be conceivable that previous reconstruction attempts are used as a criterion and first the bits are examined, in which errors have already been detected in earlier reconstructions.
    Of course, any known method (e.g., Cyclic Redundancy Check) may be used to determine the CRC, and of course, it is advantageous for use in a wireless sensor network if the computational cost of the CRC is low. The scheme is always the same. From certain data fields DF of the data packet DP, a check value CRC is calculated and appended to the data packet. The receiver then also calculates the check value CRC according to the same method from the same data fields of the received data packet DP and compares the calculated value with the transmitted check value CRC. In the case of equality, the correctness of the transmitted data is assumed, and in the case of inequality it is assumed that the data was transmitted incorrectly.
    A method for reconstructing an incorrectly received data packet in a wireless sensor network 1 can thus proceed as described by way of example with reference to FIG. To best meet the specific needs of a wireless sensor network 1, a suitable sequential sequence of reconstruction techniques is used. After a retransmission has to be requested in the next transmission cycle TZ, after a faulty receipt of a data packet DP, the reconstruction of the data packet DP must succeed within a predetermined period of time, or the retransmission is requested. It makes sense to start with the method that promises the highest probability of success with the least possible calculation effort. Then comes the method with the next best probability of success and / or next best computational effort. Success probability is the probability that the reconstruction method can be performed within the available time.
    In step S1, a data packet DP sent by a radio node FKn is received in a receiving unit 2 and the check value CRC is checked. If the check value CRC is correct, the data packet DP (or a part thereof) is forwarded to a superordinate application level, here e.g. to the control unit SE. If the check value CRC does not agree with the content of the data packet DP, the first method (A priori method) for the reconstruction of the data packet DP is used in step S2, in which the previously known content of data fields DF is checked. With this method, it is possible to check precisely determined bits of the data packet DP with little computation effort and thus offers a high probability of success. If this does not lead to the reconstruction of the data packet DP, the second method (a posteriori method) can be used in step S3, if sufficient time remains, in which information about data fields DF is derived directly from the content of the data packet DP. This method requires a little more computational effort, because first certain data fields DF must be evaluated. Since the a priori method and the a posteriori method are similar, they could also be performed in one step. If this also does not lead to success, the third method (Consecutive Bits) can be used in step S4, if sufficient time remains. Since many bit combinations have to be used here and the CRC check value has to be calculated in each case, this method requires a corresponding amount of computation. If this too is unsuccessful and if sufficient time remains, the received data packet DP is stored in a data packet buffer 3 in step S5. If data packets DP 'received erroneously from the radio node FKn are already contained in the data packet buffer 3 (query S6), a known combinatorial testing method can be used in step S7. If no previously received data packets DP 'are contained in the data packet buffer 3 or if the combination testing process also does not lead to success, a retransmission of the data packet DP is initiated in step S8. In step S9 is waited for the newly transmitted data packet DP, which repeats the procedure after receiving this data packet DP.
    Of course, various modifications are conceivable here. For example, as a second method, instead of the a posteriori method, the consecutive bits method could be used, or the order of the second, third and further methods could be changed, wherein it is advantageous to rank the methods to be used according to the calculation effort.
    权利要求:
    Claims (8)
    [1]
    1. A method for the reconstruction of a faulty received data packet (DP), in a wireless sensor network (1) from a radio node (FK) to a receiving unit (2) was sent, characterized in that in the receiving unit (2) has a first and a second method for the reconstruction of the erroneously received data packet (DP) is implemented, in a first step, the first method for the reconstruction of the erroneously received data packet (DP) is applied, thereby checking whether the data packet (DP) has been reconstructed therewith, and a second step, the second method for the reconstruction of the erroneously received data packet (DP) is applied, if the erroneously received data packet (DP) was not reconstructed with the first method, and it is checked whether the data packet (DP) was reconstructed therewith.
    [2]
    2. The method according to claim 1, characterized in that in at least one further subsequent step, a further, in the receiving unit (2) implemented method for the reconstruction of the erroneously received data packet (DP) is applied, if the erroneously received data packet (DP) with the The second method was not reconstructed, and it is checked whether the data packet (DP) was reconstructed with it.
    [3]
    3. The method according to claim 1 or 2, characterized in that in the first method the value of at least one bit of a data field (DF) of the data packet (DP) is known and in the incorrectly received data packet (DP) this at least one bit is changed and thereby It is checked whether with this change the data packet (DP) was reconstructed.
    [4]
    4. The method according to claim 1 or 2, characterized in that in the second method from the erroneously received data packet (DP), the expected value of at least one bit of a data field (DF) is derived and this at least one bit in the erroneously received data packet (DP) is changed and it is checked whether this change the data packet (DP) was reconstructed.
    [5]
    5. The method of claim 1 or 2, characterized in that in the second or in the further method, an error block (FB) with a length (i) of bits is pushed stepwise over at least part of the erroneously received data packet (DP) and in every step in the error block (FB) bits are inverted and checked in each step, whether this change the data packet (DP) was reconstructed.
    [6]
    6. The method according to claim 5, characterized in that the bits lying in the error block (FB) are durchiteriert in each step and it is checked in each case whether the data packet (DP) was reconstructed with this change.
    [7]
    7. The method of claim 1 or 2, characterized in that in the second or in the further method at least two incorrectly received data packets (DP1, DP1 ') are compared with each other and bit positions are determined at which the two data packets (DP1, DP1 ') and the bits are iterated step by step at at least one of these bit positions and it is checked in each step whether the data packet (DP1) was reconstructed with this change.
    [8]
    8. The method according to claim 7, characterized in that around the bit position, a bit area (BB) with a number of bits before and / or a number of bits after the bit position is defined and the bits in the bit area (BB) are iterated step by step and thereby In each step it is checked whether with this change the data packet (DP1) was reconstructed.
    类似技术:
    公开号 | 公开日 | 专利标题
    EP3210325B1|2018-12-12|Method for reconstruction of a data packet received with errors in a wireless sensor network
    EP2681632B1|2017-11-08|Bus system with a master and a group of slaves and communication method to exchange data in such a bussystem
    DE102007028766A1|2008-12-24|Test method and electronic circuit for the secure serial transmission of data
    EP2652911B1|2021-08-18|Wire breakage diagnosis
    EP3192219A1|2017-07-19|Method for serially transmitting a frame from a transmitter to at least one receiver and participants of a bus system via a bus system
    DE102015213378A1|2016-01-21|Method and device for diagnosing a network
    DE102012206529A1|2013-10-24|Method for operating broadcast-type wireless real-time transmission system, involves giving logical subsequent to one node if data transmission is possible with preset probability, and finding relay node if transmission is not possible
    DE102010064582B3|2015-08-20|Proxy retransmission protocols for a network
    DE102016224961A1|2018-06-14|Subscriber station for a bus system and method for data transmission in a bus system
    EP3155763B1|2018-12-05|Redundant transmission of data telegrams in communication networks having ring topology
    DE102019208058A1|2020-12-03|Error detection test device for a subscriber station of a serial bus system and method for testing mechanisms for error detection during communication in a serial bus system
    WO2011051157A1|2011-05-05|Method and device for transmitting data
    DE102012110712A1|2014-04-10|Method for testing function of error detection unit of controller area network bus controller unit, involves checking incorrect data transferring frames by error detection unit during test cycle of verification of frames as defective
    EP2575282B1|2014-09-17|Device and method for receiving a secure telegram
    DE102019204115A1|2020-10-01|Subscriber station for a serial bus system and method for communication in a serial bus system
    DE102019200690A1|2020-07-23|Method of operating a primary communication device
    EP2605457A1|2013-06-19|Method for transferring user data
    DE102012210816A1|2014-01-02|Data packet for a bidirectional transmission of data packets in a data transmission between a first and a second communication device and method for transmitting such a data packet
    WO2020088999A1|2020-05-07|Subscriber station for a serial bus system and method for transmitting a message in a serial bus system
    DE102017223774A1|2019-06-27|Subscriber station for a serial bus system and method for error signaling for a message received in a serial bus system
    DE102010003492B4|2015-02-12|Proxy retransmission protocols for a network
    WO2020120550A1|2020-06-18|Overlap detection unit for a subscriber station of a serial bus system, and method for communicating in a serial bus system
    DE102017223776A1|2019-06-27|Subscriber station for a serial communication network and method for correcting single errors in a message of a serial communication network
    WO2021004835A1|2021-01-14|Method and data network for communicating data content, in particular in an elevator system
    EP2260619B1|2014-07-09|Method and device for transferring a data unit and system comprising such a device
    同族专利:
    公开号 | 公开日
    US10193572B2|2019-01-29|
    US20170338835A1|2017-11-23|
    JP2018501683A|2018-01-18|
    EP3210325A1|2017-08-30|
    AT514851A3|2015-12-15|
    CN107005350A|2017-08-01|
    EP3210325B1|2018-12-12|
    WO2016062865A1|2016-04-28|
    CN107005350B|2020-04-14|
    AT514851B1|2019-07-15|
    JP6676631B2|2020-04-08|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    US3668631A|1969-02-13|1972-06-06|Ibm|Error detection and correction system with statistically optimized data recovery|
    US6314433B1|1998-06-12|2001-11-06|Hewlett-Packard Company|Frame-based heroic data recovery|
    US20030053435A1|2001-05-22|2003-03-20|Nagabhushana Sindhushayana|Enhanced channel interleaving for optimized data throughput|
    US8327232B2|2009-04-20|2012-12-04|Honeywell International Inc.|Apparatus and method for improved reliability of wireless communications using packet combination-based error correction|
    EP2779506A2|2013-03-15|2014-09-17|Echelon Corporation|A method and system for enhancing communication reliability when multiple corrupted frames are received|
    DE10034977A1|2000-07-13|2002-01-24|Ihp Gmbh|Method and device system for data transmission|
    WO2002071640A1|2001-03-05|2002-09-12|Intervideo, Inc.|Systems and methods for encoding and decoding redundant motion vectors in compressed video bitstreams|
    EP1710940A1|2005-04-06|2006-10-11|Siemens Aktiengesellschaft|Detection of errors during the transmission of data|
    DE102008024255A1|2008-05-20|2009-12-10|Siemens Enterprise Communications Gmbh & Co. Kg|Devices and methods for processing data packets of a data stream, as well as a use of the devices|
    US8543893B2|2009-09-02|2013-09-24|Agere Systems Llc|Receiver for error-protected packet-based frame|
    US8684623B2|2012-05-30|2014-04-01|Caterpillar Inc.|Tool coupler having anti-release mechanism|
    US9059832B2|2012-08-01|2015-06-16|The United States Of America As Represented By The Secretary Of The Air Force|Rank deficient decoding of linear network coding|
    US9654196B2|2013-01-17|2017-05-16|Telefonaktiebolaget L M Ericsson|Methods of transmitting and/or receiving data transmissions using information relating to other data transmissions and related network nodes|
    CN104079391B|2013-03-27|2018-09-07|华为技术有限公司|A kind of data pack transmission method, system and communication equipment|
    AT514851B1|2014-10-23|2019-07-15|Avl List Gmbh|A method of reconstructing a data packet erroneously received in a wireless sensor network|AT514851B1|2014-10-23|2019-07-15|Avl List Gmbh|A method of reconstructing a data packet erroneously received in a wireless sensor network|
    US11237546B2|2016-06-15|2022-02-01|Strong Force loT Portfolio 2016, LLC|Method and system of modifying a data collection trajectory for vehicles|
    US11156998B2|2016-05-09|2021-10-26|Strong Force Iot Portfolio 2016, Llc|Methods and systems for process adjustments in an internet of things chemical production process|
    US10921801B2|2017-08-02|2021-02-16|Strong Force loT Portfolio 2016, LLC|Data collection systems and methods for updating sensed parameter groups based on pattern recognition|
    US20190064791A1|2016-05-09|2019-02-28|Strong Force Iot Portfolio 2016, Llc|Methods and systems for detection in an industrial internet of things data collection environment with intelligent management of data selection in high data volume data streams|
    CN108337228B|2017-01-13|2020-11-10|株式会社自动网络技术研究所|In-vehicle device, relay device, and medium|
    US10831206B2|2017-11-08|2020-11-10|Tesla, Inc.|Autonomous driving system emergency signaling|
    DE102020202226A1|2020-02-20|2021-08-26|Iba Ag|Process and transmission system for the transmission of measurement data|
    US20220021480A1|2020-07-17|2022-01-20|Audiowise Technology Inc.|Wireless communication method and wireless communication device which uses the wireless communication method|
    法律状态:
    优先权:
    申请号 | 申请日 | 专利标题
    ATA50762/2014A|AT514851B1|2014-10-23|2014-10-23|A method of reconstructing a data packet erroneously received in a wireless sensor network|ATA50762/2014A| AT514851B1|2014-10-23|2014-10-23|A method of reconstructing a data packet erroneously received in a wireless sensor network|
    CN201580065174.9A| CN107005350B|2014-10-23|2015-10-23|Method for reconstructing erroneously received data packets in a wireless sensor network|
    PCT/EP2015/074616| WO2016062865A1|2014-10-23|2015-10-23|Method for reconstructing a data packet defectively received in a wireless sensor network|
    US15/521,495| US10193572B2|2014-10-23|2015-10-23|Method for reconstructing a data packet incorrectly received in a wireless sensor network|
    JP2017522148A| JP6676631B2|2014-10-23|2015-10-23|Method for reconstructing erroneously received data packets in a wireless sensor network|
    EP15784395.4A| EP3210325B1|2014-10-23|2015-10-23|Method for reconstruction of a data packet received with errors in a wireless sensor network|
    [返回顶部]